Synthesis of Oleana-12, 15-diene

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

8β-Eth­oxy­eremophil-3,7(11)-diene-8α,12;6α,15-diolide

The title compound, C17H20O5, an eremophilane sesquiternoid, was isolated from the roots of Ligularia lapathifolia. The mol-ecule contains four fused rings of which the six-membered ring A adopts a half-chair conformation, the six-membered ring B adopts a chair conformation, the five-membered ring C is almost planar (r.m.s. deviation = 0.015 Å) and the five-membered ring D adopts an envelope co...

متن کامل

STANTON 12-15.indd

Research Assistant; Russell Mellor is Research Assistant; Peter Mortimer is Professor of Dermatological Medicine, Division of Cardiac and Vascular Sciences (Dermatology); Rodney Levick is Professor of Physiology, Division of Basic Medical Sciences (Physiology) all at St George’s, University of London *These authors contributed equally to this work Lymphoedema of the arm is acknowledged as a ser...

متن کامل

Gas-Phase Synthesis of 1-Silacyclopenta-2,4-diene.

Silole (1-silacyclopenta-2,4-diene) was synthesized for the first time by the bimolecular reaction of the simplest silicon-bearing radical, silylidyne (SiH), with 1,3-butadiene (C4 H6 ) in the gas phase under single-collision conditions. The absence of consecutive collisions of the primary reaction product prevents successive reactions of the silole by Diels-Alder dimerization, thus enabling th...

متن کامل

12 - 15 pages in LNCS

The limited description, discovery and integration mechanisms of current web service-based systems have many setbacks that hinder the extension and incorporation of dynamic capabilities into these systems. In this paper we present a novel software architecture called intelligent aspect-oriented web services (IAOWS) which addresses these problems and further improves on this technology by allowi...

متن کامل

Lecture 15 — April 12 , 2012

We care not only about the value of the minimum element, but also about the index k of the minimum element between A[i] and A[j]; given the index, it is easy to look up the actual value of the minimum element, so it is a more interesting problem to find the index of the minimum element between A[i] and A[j]. The range minimum query problem is not a tree problem, but it closely related to a tree...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nippon kagaku zassi

سال: 1962

ISSN: 0369-5387,2185-0917

DOI: 10.1246/nikkashi1948.83.87